118.2: Non-simultaneous kidney exchange cycles in resource restricted countries without non directed donation.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domino paired kidney donation: a strategy to make best use of live non-directed donation.

Current models for allocation of kidneys from living non-directed donors Living non-directed (LND) donors, also known as altruistic, good Samaritan, anonymous, or benevolent community donors, are a new and rapidly growing source of solid organs for transplantation. The willingness of individuals to donate organs without a designated recipient has been unexpected, but has probably developed as a...

متن کامل

Directed Graphs Without Short Cycles

For a directed graph G without loops or parallel edges, let β(G) denote the size of the smallest feedback arc set, i.e., the smallest subset X ⊂ E(G) such that G \X has no directed cycles. Let γ(G) be the number of unordered pairs of vertices of G which are not adjacent. We prove that every directed graph whose shortest directed cycle has length at least r ≥ 4 satisfies β(G) ≤ cγ(G)/r, where c ...

متن کامل

Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs

Let G be a graph embedded on a surface of genus g with b boundary cycles. We describe algorithms to compute multiple types of non-trivial cycles in G, using different techniques depending on whether or not G is an undirected graph. If G is undirected, then we give an algorithm to compute a shortest non-separating cycle in 2O(g)n log log n time. Similar algorithms are given to compute a shortest...

متن کامل

Faster Shortest Non-contractible Cycles in Directed Surface Graphs

Let G be a directed graph embedded on a surface of genus g with b boundary cycles. We describe an algorithm to compute the shortest non-contractible cycle in G in O((g3 + g b)n log n) time. Our algorithm improves the previous best known time bound of (g + b)O(g+b)n log n for all positive g and b. We also describe an algorithm to compute the shortest non-null-homologous cycle in G in O((g2 + g b...

متن کامل

Paired Kidney Donation and Listed Exchange

Deceased-donor and live-donor kidneys are the two sources for transplantation, and these sources are utilized via two different programs. One of these programs, a paired kidney donation (PKD), involves two donor-patient pairs, for each of whom transplantation from donor to intended recipient is not possible due to medical incompatibilities, but such that the patient in each couple could receive...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transplantation

سال: 2019

ISSN: 0041-1337

DOI: 10.1097/01.tp.0000611624.91513.a2